The equivalence problem for deterministic finite-turn pushdown automata
نویسندگان
چکیده
منابع مشابه
The Equivalence Problem for Deterministic Finite-Turn Pushdown Automata
A deterministic pushdown automaton (dpda) is described as finite-turn if there is a bound on the number of times the direction of the stack movement can change in the set of all derivations from the starting configuration. The purpose of this paper is to show that there exists a procedure for deciding whether two such finite-turn machines recognize the same language. By virtue of a direct corre...
متن کاملDeciding Equivalence of Deterministic Pushdown Automata
Deterministic pushdown automata (DPDA) are a class of simple yet powerful models of computation. It has a finite set of states and a (pushdown) stack. Depending on the current state, the symbol at the top of the stack, and the symbol of the input word that has just been scanned, the automaton moves to a new state, either pushes or pops a symbol on the stack, and it is ready to scan the next sym...
متن کاملHeight-Deterministic Pushdown Automata
We define the notion of height-deterministic pushdown automata, a model where for any given input string the stack heights during any (nondeterministic) computation on the input are a priori fixed. Different subclasses of height-deterministic pushdown automata, strictly containing the class of regular languages and still closed under boolean language operations, are considered. Several such lan...
متن کاملDeterministic Frequency Pushdown Automata
A set L is (m,n)-computable iff there is a mechanism which on input of n different words produces n conjectures whether these words are in L, respectively, such that at least m of these conjectures are right. Prior studies dealt with (m,n)computable sets in the contexts of recursion theory, complexity theory and the theory of finite automata. The present work aims to do this with respect to com...
متن کاملThe Equivalence Problem of Multitape Finite Automata
Using a result of B.H. Neumann we extend Eilenberg’s Equality Theorem to a general result which implies that the multiplicity equivalence problem of two (nondeterministic) multitape finite automata is decidable. As a corollary we solve a long standing open problem in automata theory, namely, the equivalence problem for multitape deterministic finite automata. The main theorem states that there ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1974
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(74)90839-0